Computing the Interleaving Distance is NP-Hard
نویسندگان
چکیده
منابع مشابه
Computing the discrete Fréchet distance upper bound of imprecise input is NP-hard
The Fréchet distance is a natural measure of similarity between two curves [4]. The Fréchet distance between two curves is often referred to as the “dog-leash distance”. Alt and Godau [4] presented an algorithm to compute the Fréchet distance between two polygonal curves of n and m vertices in O(nm log(nm)) time. There has been a lot of applications using the Fréchet distance to do pattern/curv...
متن کاملComputing the maximum matching width is NP-hard
The maximum matching width is a graph width parameter that is defined on a branchdecomposition over the vertex set of a graph. In this short paper, we prove that the problem of computing the maximum matching width is NP-hard.
متن کاملComputing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.
متن کاملComputing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case.
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2019
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-019-09442-y